Notes on "Ideal 0, 1 matrices" by Cornuéjols and Novick
نویسنده
چکیده
In 1994, Cornuéjols and Novick published a classification of ideal and minimally non ideal circulant clutters. One of their main results for doing so relates contractions of these clutters, simple directed cycles in an appropriate graph, and algebraic conditions. The purpose of this paper is twofold: to correct a small inaccuracy of the necessity of the algebraic conditions in the original proof, and to show that these algebraic conditions are actually sufficient, by giving a constructive proof of the existence of cycles.
منابع مشابه
A new infinite family of minimally nonideal matrices
Minimally nonideal matrices are a key to understanding when the set covering problem can be solved using linear programming. The complete classification of minimally nonideal matrices is an open problem. One of the most important results on these matrices comes from a theorem of Lehman, which gives a property of the core of a minimally nonideal matrix. Cornuéjols and Novick gave a conjecture on...
متن کاملResistant sets in the unit hypercube
Ideal matrices and clutters are prevalent in Combinatorial Optimization, ranging from balanced matrices, clutters of T -joins, to clutters of rooted arborescences. Most of the known examples of ideal clutters are combinatorial in nature. In this paper, rendered by the recently developed theory of cuboids, we provide a different class of ideal clutters, one that is geometric in nature. The advan...
متن کاملA polynomial recognition algorithm for balanced matrices
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti, Cornuéjols and Rao [9], and Conforti, Cornuéjols, Kapoor and Vušković [6], provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduce...
متن کاملBalanced 0-1 Matrices I. Decomposition
A 0, \1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0, 1 matrices obtained by Conforti, Cornue jols, and Rao (1999, J. Combin. Theory Ser. B 77, 292 406) to the class of balanced 0, \1 matrices. As a consequence, we obtain a polynomial time algorithm f...
متن کاملRecognizing Balanceable Matrices
A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/ ± 1 matrices and balanceable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 98 شماره
صفحات -
تاریخ انتشار 2008